A Task Duplication Based Scheduling Algorithm for Avoiding Useless Duplication
نویسندگان
چکیده
In this paper, we propose a task duplication based scheduling algorithm for avoiding useless duplication. In our algorithm, task duplication is divided into two phases: a task fill phase and a task duplication phase. In the task fill phase, tasks are duplicated and allocated to idle time slots in used processors. Namely, the task fill phase does not require additional idle processors. The task duplication phase is invoked only if there are idle processors to be left for a new allocation. Thus, our algorithm can consume computing facilities effectively. Experimental results show that our algorithm can achieve less computation time and less use of idle processors.
منابع مشابه
Green Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملEconomical Task Scheduling Algorithm for Grid Computing Systems
Task duplication is an effective scheduling technique for reducing the response time of workflow applications in dynamic grid computing systems. Task duplication based scheduling algorithms generate shorter schedules without sacrificing efficiency but leave the computing resources over consumed due to the heavily duplications. In this paper, we try to minimize the duplications of tasks from the...
متن کاملA Critical Predecessor Duplication Scheduling Algorithm for Distributed Heterogeneous Computing Environments
This paper proposes a new duplication-based scheduling algorithm, called the Critical Predecessor Duplication scheduling algorithm, to exploit the potential of parallel processing in distributed heterogeneous computing systems. In such systems, designing efficient scheduling algorithm may lead to a significant variation in the generated schedule. The proposed scheduling algorithm could improve ...
متن کاملS3MP: A Task Duplication Based Scalable Scheduling Algorithm for Symmetric Multiprocessors
We present a task duplication based scalable scheduling algorithm for Symmetric Multiprocessors (SMP), called S3MP (Scalable Scheduling for SMP), to address the problem of task scheduling. The algorithm pre-allocates network communication resources so as to avoid potential communication conflicts, and generates a schedule for the number of processors available in a SMP. This algorithm employs h...
متن کاملOn Exploiting Task Duplication in Parallel Program Scheduling
Abstract One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executing on different processors exchange data. Given a task graph, duplication-based scheduling can mitigate this overhead by allocating some of the tasks redundantly on more than one processors. In this paper, we foc...
متن کامل